Quasi-cyclic perfect codes in Doob graphs and special partitions of Galois rings
نویسندگان
چکیده
The Galois ring GR$(4^\Delta)$ is the residue $Z_4[x]/(h(x))$, where $h(x)$ a basic primitive polynomial of degree $\Delta$ over $Z_4$. For any odd larger than $1$, we construct partition GR$(4^\Delta) \backslash \{0\}$ into $6$-subsets type $\{a,b,-a-b,-a,-b,a+b\}$ and $3$-subsets $\{c,-c,2c\}$ such that invariant under multiplication by nonzero element Teichmuller set in and, if not multiple $3$, action automorphism group GR$(4^\Delta)$. As corollary, this implies existence quasi-cyclic additive $1$-perfect codes index $(2^\Delta-1)$ $D((2^\Delta-1)(2^\Delta-2)/{6}, 2^\Delta-1 )$ $D(m,n)$ Doob metric scheme on $Z^{2m+n}$.
منابع مشابه
Perfect codes in Doob graphs
We study 1-perfect codes in Doob graphsD(m,n). We show that such codes that are linear over GR(4) exist if and only if n = (4γ+δ−1)/3 andm = (4γ+2δ−4γ+δ)/6 for some integers γ ≥ 0 and δ > 0. We also prove necessary conditions on (m,n) for 1-perfect codes that are linear over Z4 (we call such codes additive) to exist in D(m,n) graphs; for some of these parameters, we show the existence of codes....
متن کاملSkew Cyclic and Quasi-Cyclic Codes of Arbitrary Length over Galois Rings
We mainly investigate the structures of skew cyclic and skew quasicyclic codes of arbitrary length over Galois rings. Similar to [5], our results show that the skew cyclic codes are equivalent to either cyclic and quasi-cyclic codes over Galois rings. Moreover, we give a necessary and sufficient condition for skew cyclic codes over Galois rings to be free. A sufficient condition for 1-generator...
متن کاملMDS codes in Doob graphs
Аннотация The Doob graph D(m, n), where m > 0, is the direct product of m copies of The Shrikhande graph and n copies of the complete graph K 4 on 4 vertices. The Doob graph D(m, n) is a distance-regular graph with the same parameters as the Hamming graph H(2m + n, 4). In this paper we consider MDS codes in Doob graphs with code distance d ≥ 3. We prove that if 2m + n > 6 and 2 < d < 2m + n, th...
متن کاملEnumeration and construction of additive cyclic codes over Galois rings
Let R = GR(p, l) be a Galois ring of characteristic p and cardinality pεl, where p and l are prime integers. First, we give a canonical form decomposition for additive cyclic codes over R. This decomposition is used to construct additive cyclic codes and count the number of such codes, respectively. Thenwe give the trace dual code for each additive cyclic code over R from its canonical form dec...
متن کاملQuasi-Cyclic Codes Over Finite Chain Rings
In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we investigate the structural properties of 1-generator QC codes. Under some conditions, we discuss the enumeration of 1-generator QC codes and describe how to o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3272566